// Problem: 
// Contest: 
// URL: 
// Memory Limit: 
// Time Limit: 
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read(){
	int s=0,w=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
	while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
	return s*w;
}
signed main()
{
	int t=1;
//	cin>>t;
	while(t--)
	{
		int n;
		cin>>n;
		vector<int> a(n+1),b(n+1);
		for(int i=1;i<=n;i++)
		{
			cin>>a[i]>>b[i];
		}
		sort(a.begin()+1,a.end());
		sort(b.begin()+1,b.end());
		int ans=0;
		for(int i=1;i<=n;i++)
		{
			ans+=b[i]-a[i];
			if(i-1>0&&b[i-1]>a[i])
				ans-=b[i-1]-a[i];
		}
		cout<<ans;
	}
	return 0;
}
